Bounds on the spectral radius of general hypergraphs in terms of clique number

The spectral radius (or the signless Laplacian radius) of a general hypergraph is maximum modulus eigenvalues its adjacency Laplacian) tensor. In this paper, we firstly obtain lower bound hypergraphs in terms clique number. Moreover, present relation between homogeneous polynomial and number hypergraphs. As an application, finally upper